Hard Tiling Problems with Simple Tiles
نویسندگان
چکیده
It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right tromino alone. In the process, we show that Monotone 1-in-3 Satisfiability is NP-complete for planar cubic graphs. In higher dimensions, we show NP-completeness for the domino and straight tromino for general regions on the cubic lattice, and for simplyconnected regions on the four-dimensional hypercubic lattice.
منابع مشابه
Tetravex is NP-complete
TETRAVEX is a widely played one person computer game in which you are given n2 unit tiles, each edge of which is labelled with a number. The objective is to place each tile within a n by n square such that all neighbouring edges are labelled with an identical number. Unfortunately, playing TETRAVEX is computationally hard. More precisely, we prove that deciding if there is a tiling of the TETRA...
متن کاملA Note on Tiling under Tomographic Constraints
Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the projections. We are interested in the problem of reconstructing a tiling which has given projections. Some simple variants of this problem, involving tiles that are 1× 1 or 1× 2 rectangles, have been studied in the past, and were ...
متن کاملA Small Aperiodic Set of Tiles
We give a simple set of two tiles that can only tile aperiodically | that is no tiling with these tiles is invariant under any in nite cyclic group of isometries. Although general constructions for producing aperiodic sets of tiles are nally appearing, simple aperiodic sets are fairly rare. This set is among the smallest sets ever found. A tiling is non-periodic if there is no in nite cyclic gr...
متن کاملTiling with Small Tiles
We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems – we give an example of this. We also present a result to a more classic tiling question with dominoes and L-shape tiles.
متن کاملAspects of a multivariate complexity analysis for Rectangle Tiling
We initiate a parameterized complexity study of the NP-hard problem to tile a positive integer matrix with rectangles, keeping the number of tiles and their maximum weight small. We show that the problem remains NP-hard even for binary matrices only using 1× 1 and 2× 2-squares as tiles and provide insight into the influence of naturally occurring parameters on the problem’s complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 26 شماره
صفحات -
تاریخ انتشار 2001